RELATIONSHIP BETWEEN THE PERIOD OF A FINITE WORD AND THE LENGTH OF ITS UNBORDERED SEGMENTSDUVAL JP.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 40; NO 1; PP. 31-44; BIBL. 8 REF.Article

SUR CERTAINES APPLICATIONS SEQUENTIELLES NUMERIQUES.CHRISTIAN C.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 33; NO 4; PP. 352-363; ABS. ANGL.; BIBL. 13 REF.Article

SUR LES RELATIONS RATIONNELLES ENTRE MONOIDES LIBRES.SCHUETZENBERGER MP.1976; THEOR. COMPUT. SCI.; NETHERL.; DA. 1976; VOL. 3; NO 2; PP. 243-259; BIBL. 4 REF.Article

CODES ET SOUS-MONOIDES POSSEDANT DES MOTS NEUTRES.PERRIN D; SCHUTZENBERGER MP.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 214; PP. 1-12; ABS. ANGL.; BIBL. 9 REF.Serial Issue

ON THE TRIANGLE CONJECTUREDE FELICE C.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 197-200; BIBL. 4 REF.Article

SUR UNE CARACTERISATION DES PARTIES RECONNAISSABLES D'UN MONOIDE LIBRE.SCHUTZENBERGER MP.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 247-251; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

L HOMOMORPHISMS AND REDUCTIONS OF OL SYSTEMSLANGE KJ.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 197-205; BIBL. 6 REF.Article

UNE PREUVE COMBINATOIRE DE LA RATIONALITE D'UNE SERIE GENERATRICE ASSOCIEE AUX ARBRESCHOTTIN L; CORI R.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 2; PP. 113-128; ABS. ENG; BIBL. 12 REF.Article

ON REPRESENTABILITY OF P. MARTIN-LOEF TESTSCALUDE C; CHITESCU I.1983; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1983; VOL. 19; NO 1; PP. 42-47; BIBL. 6 REF.Article

PERIODES ET REPETITIONS DES MOTS DU MONOIDE LIBREDUVAL JP.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 17-26; ABS. ENG; BIBL. 9 REF.Article

SUR LE POINT DE CONCATENATION NON AMBIGU.SCHUTZENBERGER MP.1976; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1976; NO 181; PP. 1-29; ABS. ANGL.; BIBL. 1 P. 1/2Serial Issue

EQUATIONS AVEC CONSTANTES ET ALGORITHME DE MAKANIN = EQUATIONS WITH CONSTANTS AND MAKANIN'S ALGORITHMPECUCHET JEAN PIERRE.1981; ; FRA; DA. 1981; 146 P.; 21 CM; BIBL. DISSEM.; TH. 3E CYCLE: MATH./ROUEN/1981Thesis

MOTS DE RYNDON ET PERIODICITEDUVAL JP.1980; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1980; VOL. 14; NO 2; PP. 181-191; ABS. ENG; BIBL. 12 REF.Article

A GENERALIZATION OF GINSBURG AND ROSE'S CHARACTERIZATION OF G-S-M MAPPINGSCHOFFRUT C.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 88-103; BIBL. 8 REF.Conference Paper

ON METRIZABILITY OF THE FREE MONOIDS.CALUDE C.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 4; PP. 307-310; BIBL. 6 REF.Article

ON THE EQUIVALENCE PROBLEM FOR BINARY DOL SYSTEMSKARHUMAEKI J.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 339-347; BIBL. 12 REF.Conference Paper

ON THE EQUIVALENCE PROBLEM FOR BINARY DOL SYSTEMSKARHUMAEKI J.1982; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 50; NO 3; PP. 276-284; BIBL. 12 REF.Article

UNE FAMILLE DE CODES INDECOMPOSABLES = A FAMILY OF NON-DECOMPOSABLE CODESVINCENT MAX.1982; ; FRA; DA. 1982; 39 P.; 30 CM; BIBL. 16 REF.; TH. 3EME CYCLE: MATH. APPL./MONTPELLIER 2/1982/756Thesis

PREFIX-PRESERVATION FOR RATIONAL PARTIAL FUNCTIONS IS DECIDABLECHOFFRUT C.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 159-166; BIBL. 6 REF.Conference Paper

TOPOLOGIES ON FREE MONOIDS INDUCED BY CLOSURE OPERATORS OF A SPECIAL TYPEPRODINGER H.1980; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1980; VOL. 14; NO 2; PP. 225-237; ABS. FRE; BIBL. 11 REF.Article

SOME PROPERTIES OF DISJUNCTIVE LANGUAGES ON A FREE MONOID.REIS CM; SHYR HJ.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 37; NO 3; PP. 334-344; BIBL. 6 REF.Article

On the rank of the subsets of a free monoidNERAUD, J.Theoretical computer science. 1992, Vol 99, Num 2, pp 231-241, issn 0304-3975Article

An algorithm for constructing magic squaresKIM, Yangkok; YOO, Jaechil.Discrete applied mathematics. 2008, Vol 156, Num 14, pp 2804-2809, issn 0166-218X, 6 p.Article

An algorithmic approach to the problem of a semiretract baseFORYS, Wit; KRAWCZYK, Tomasz.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 314-322, issn 0304-3975, 9 p.Article

A NEW CHARACTERIZATION THEOREM OF TREE-TRANSDUCTIONSESTENFELD K.1982; ELEKTRONISCHE INFORMATIONSVERARBEITUNG UND KYBERNETIK; ISSN 0013-5712; DDR; DA. 1982; VOL. 18; NO 4-5; PP. 187-204; ABS. GER/RUS; BIBL. 15 REF.Article